Model checking restricted sets of timed paths
نویسندگان
چکیده
منابع مشابه
Model Checking Restricted Sets of Timed Paths
In this paper, we study the complexity of model-checking formulas of three important real-time logics (MTL, MITL, and TCTL) over restricted sets of timed paths. The classes of restricted sets of timed paths that we consider are (i) a single finite (or ultimately periodic) timed path, (ii) a infinite set of finite (or infinite) timed paths defined by a finite (or ultimately periodic) path in a r...
متن کاملModel Checking Timed Automata
The theory of timed automata provides a formal framework to model and to verify the correct functioning of real-time systems. Among the di erent veri cation problems that have been investigated within this theory, the so-called reachability problem has been the most throughly studied. This problem is stated as follows. Given two states of the system, is there an execution starting at one of the...
متن کاملModel Checking Timed Automata
Different time scales do often occur in real-time systems, e.g., a polling real-time system samples the environment many times per second, whereas the environmentmay only change a few times per second. When these systems are modeled as (networksof) timed automata, the verification using symbolic model checking techniques can signif-icantly be slowed down by unnecessary fragmenta...
متن کاملModel checking Timed CSP
Though Timed CSP was developed 25 years ago and the CSP-based refinement checker FDR [25] was first released 20 years ago, there has never been a version of this tool for Timed CSP. In this paper we report on the creation of such a version, based on the digitisation results of Ouaknine [16, 17] and the associated development of discrete-time versions of Timed CSP with associated models [19, 14,...
متن کاملModel-checking Timed Temporal Logics
In this paper, we present several timed extensions of temporal logics, that can be used for model-checking real-time systems. We give different formalisms and the corresponding decidability/complexity results. We also give intuition to explain these results.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2006
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2006.01.019